翻訳と辞書
Words near each other
・ Harel
・ Harel Brigade
・ Harel Group
・ Harel Levy
・ Harel Locker
・ Harel Mallac Group
・ Harel Moyal
・ Hardyville, Virginia
・ Hardywood Park Craft Brewery
・ Hardy–Littlewood circle method
・ Hardy–Littlewood inequality
・ Hardy–Littlewood maximal function
・ Hardy–Littlewood tauberian theorem
・ Hardy–Littlewood zeta-function conjectures
・ Hardy–Ramanujan Journal
Hardy–Ramanujan theorem
・ Hardy–Weinberg principle
・ Hardzei Tsishchanka
・ Hard–easy effect
・ Hare
・ Hare & Hare
・ Hare (computer virus)
・ Hare (disambiguation)
・ Hare (hieroglyph)
・ Hare (MCC cricketer)
・ Hare (surname)
・ Hare Ame Nochi Suki
・ Hare and Billet
・ Hare and Dunhog Mosses
・ Hare and Hound (motorcycle race)


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Hardy–Ramanujan theorem : ウィキペディア英語版
Hardy–Ramanujan theorem
In mathematics, the Hardy–Ramanujan theorem, proved by , states that the normal order of the number ω(''n'') of distinct prime factors of a number ''n'' is log(log(''n'')).
Roughly speaking, this means that most numbers have about this number of distinct prime factors.
==Precise statement==
A more precise version states that for any real-valued function ψ(''n'') that tends to infinity as ''n'' tends to infinity
:|\omega(n)-\log(\log(n))|<\psi(n)\sqrt
or more traditionally
:|\omega(n)-\log(\log(n))|<^
for ''almost all'' (all but an infinitesimal proportion of) integers. That is, let ''g''(''x'') be the number of positive integers ''n'' less than ''x'' for which the above inequality fails: then ''g''(''x'')/''x'' converges to zero as ''x'' goes to infinity.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Hardy–Ramanujan theorem」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.